Shape Decision-Making in Map-Like Visualization Design Using the Simulated Annealing Algorithm
نویسندگان
چکیده
منابع مشابه
Decision-Making Optimization of TMT: A Simulated Annealing Algorithm Analysis
The decision-making of Top management team (TMT) has been a hot point in academic. The paper find out annealing algorithm method can effectively solve the decision-making optimization problem. Through considering the quality and efficiency of decision-making, applying the annealing algorithm, the optimal decision preference sequence is found. Finally, an application case is proposed. Through de...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملShape Optimal Design on Double-Chamber Mufflers Using Simulated Annealing and a Genetic Algorithm
Whilst the space volume of mufflers in a noise control system is often constrained for maintenance and operation in practical engineering work, the maximization of the muffler’s performance becomes essential. In this paper, both simulated annealing (SA) and a genetic algorithm (GA) are applied simultaneously. A numerical case of pure tone noise control is introduced. Before optimization, one ex...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2939977